2−bondage Number of a Fuzzy Graph
نویسندگان
چکیده
In this paper, 2−bondage set of a fuzzy graph G is defined. The 2−bondage number, b2(G) is the minimum cardinality among all 2−bondage sets of G. The condition for a 2−bondage set of a fuzzy graph to be a bondage set is also given. The exact values of b2(G) is determined for several classes of fuzzy graphs.
منابع مشابه
Bondage and Non-bondage Number of a Fuzzy Graph
In this paper, bondage and non-bondage set of a fuzzy graph are discussed. The bondage number b(G) and non-bondage number bn(G) of a fuzzy graph G are defined. The upper bound for both b(G) and bn(G) are given. Also some results on b(G) and bn(G) are discussed. The exact values of b(G) and bn(G) are determined for several classes of fuzzy graphs. AMS Subject Classification: 03E72, 05C40, 05C72
متن کاملOn the bondage number of planar and directed graphs
The bondage number b(G) of a nonempty graph G is defined to be the cardinality of the smallest set E of edges of G such that the graph G − E has domination number greater than that of G. In this paper we present a simplified proof that b(G) ≤ min{8,∆(G) + 2} for all planar graphs G, give examples of planar graphs with bondage number 6, and bound the bondage number of directed graphs.
متن کاملThe Bondage Number of Graphs with Crossing Number Less than Four
The bondage number b(G) of a graph G is the smallest number of edges whose removal results in a graph with domination number greater than the domination number of G. Kang and Yuan [Bondage number of planar graphs. Discrete Math. 222 (2000), 191198] proved b(G) 6 min{8,∆+ 2} for every connected planar graph G, where ∆ is the maximum degree of G. Later Carlson and Develin [On the bondage number o...
متن کاملThe bondage numbers and efficient dominations of vertex-transitive graphs
The bondage number of a graph G is the minimum number of edges whose removal results in a graph with larger domination number.A dominating setD is called an efficient dominating set ofG if |N−[v]∩D|=1 for every vertex v ∈ V (G). In this paper we establish a tight lower bound for the bondage number of a vertex-transitive graph. We also obtain upper bounds for regular graphs by investigating the ...
متن کاملOn the complexity of some bondage problems in graphs
The paired bondage number (total restrained bondage number, independent bondage number, k-rainbow bondage number) of a graph G, is the minimum number of edges whose removal from G results in a graph with larger paired domination number (respectively, total restrained domination number, independent domination number, k-rainbow domination number). In this paper we show that the decision problems ...
متن کامل